A Comparative Complexity Study of Fixed-to-variable Length and Variable-to-fixed Length Source Codes
نویسنده
چکیده
In this paper we present an analysis of the storage complexity of Huffman codes, Tunstall codes and arithmetic codes in various implementations and relate this to the achieved redundancies. It turns out that there exist efficient implementations of both Huffman and Tunstall codes and that their approximations result in arithmetic codes. Although not optimal, the arithmetic codes still have a better redundancy per storage cell due to the fact that the storage complexity is independent of the block length.
منابع مشابه
Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
-It is demonstrated that for finite-alphabet, Kth order ergodic Markov Sources (i.e., memory of K letters), a variable-to-fixed code is better than the best fixed-to-variable code (Huffman code). It is shown how to construct a variable-to-fixed length code for a Kth order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code (Huffman code).
متن کاملUniversal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کامل2.7 Perfectly Lossless Fixed-Length to Variable-Length Block Source Codes
To obtain lower rates than perfectly lossless FFB source codes, in Sections 2.5 and 2.6 we relaxed the perfectly lossless requirement and considered almost lossless FFB source codes. In this section we maintain the perfectly lossless requirement, but relax the FFB requirement — allowing the codewords to have different lengths — again with the goal of obtaining lower rates. Specifically, we cons...
متن کاملRole of Heuristic Methods with variable Lengths In ANFIS Networks Optimum Design and Training
ANFIS systems have been much considered due to their acceptable performance in terms of creation of fuzzy classifier and training. One main challenge in designing an ANFIS system is to achieve an efficient method with high accuracy and appropriate interpreting capability. Undoubtedly, type and location of membership functions and the way an ANFIS network is trained are of considerable effect on...
متن کاملStudy on the Pull-In Instability of Gold Micro-Switches Using Variable Length Scale Parameter
In this paper, the size dependent behavior of the gold micro-switches has been studied. This behavior becomes noticeable for a structure when the characteristic size such as thickness or diameter is close to its internal length-scale parameter. The size dependent effect is insignificant for the high ratio of the characteristic size to the length-scale parameter, which is the case of the silicon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004